An approach to the static global analysis and codification of program control flow based on the "interval" partitioning of control flow graphs is given. Topics covered include dominance relations, intervals and node splitting. Also included are several new algorithms and some results of analyzing the control flow of programs by the methods described.
By: F. E. Allen, J. Cocke
Published in: RC3923 in 1972
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .